A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
نویسندگان
چکیده
منابع مشابه
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer ` together with a set S of words of length k over the four symbols A, C , G, T . The problem is to decide whether there exists a word of length ` that contains every word in S at least once as a subword, and does not contain any other subword of...
متن کاملPolynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching
We develop a new form of reweighting (Wainwright et al., 2005b) to leverage the relationship between Ising spin glasses and perfect matchings into a novel technique for the exact computation of MAP states in hitherto intractable binary Markov random fields. Our method solves an n× n lattice with external field and random couplings much faster, and for larger n, than the best competing algorithm...
متن کاملA Polynomial-time Exact Algorithm for the Subset Sum Problem
Subset sum problem, (SSP), is an important problem in complexity theory, it belongs to complexity class NP-Hard, therefore to find a polynomial-time exact algorithm that solves subset sum problem proves that P=NP. In the present paper it will be shown a theorem that allows us to develop, as described in the paper, an algorithm of polynomial-time complexity. For a deepening on complexity theory ...
متن کاملRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2007
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2006.07.004